Complexity of limit cycles with block-sequential update schedules in conjunctive networks

نویسندگان

چکیده

In this paper, we deal with the following decision problem: given a conjunctive Boolean network defined by its interaction digraph, does it have limit cycle of length k? We prove that problem is NP-complete in general if k parameter and P digraph strongly connected. The case where fixed, but not connected, remains open. Furthermore, study some variations network, there exist block-sequential (resp. sequential) update schedule such these problems are for any fixed constant $$k \ge 2$$ .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block-sequential update schedules and Boolean automata circuits

Our work is set in the framework of complex dynamical systems and, more precisely, that of Boolean automata networks modeling regulation networks. We study how the choice of an update schedule impacts on the dynamics of such a network. To do this, we explain how studying the dynamics of any network updated with an arbitrary blocksequential update schedule can be reduced to the study of the dyna...

متن کامل

Update schedules of sequential dynamical systems

Sequential dynamical systems have the property, that the updates of states of individual cells occur sequentially, so that the global update of the system depends on the order of the individual updates. This order is given by an order on the set of vertices of the dependency graph. It turns out that only a partial suborder is necessary to describe the global update. This paper defines and studi...

متن کامل

the effect of task cognitive complexity and time limit on the performance of the learners with different proficiency levels in second language writing skill

this study investigated the effects of manipulating the cognitive complexity of tasks along +/- few elements and the time limits on l2 learners writing performance. to conduct the study, 60 iranian efl learners with two levels of proficiency, low and high intermediate, were selected and assigned to three groups based on the time devoted to task completion. the participants performed both a simp...

15 صفحه اول

On the robustness of update schedules in Boolean networks

Deterministic Boolean networks have been used as models of gene regulation and other biological networks. One key element in these models is the update schedule, which indicates the order in which states are to be updated. We study the robustness of the dynamical behavior of a Boolean network with respect to different update schedules (synchronous, block-sequential, sequential), which can provi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Natural Computing

سال: 2023

ISSN: ['1572-9796', '1567-7818']

DOI: https://doi.org/10.1007/s11047-023-09947-0